全文获取类型
收费全文 | 822篇 |
免费 | 161篇 |
国内免费 | 27篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 15篇 |
2020年 | 12篇 |
2019年 | 21篇 |
2018年 | 11篇 |
2017年 | 48篇 |
2016年 | 48篇 |
2015年 | 28篇 |
2014年 | 56篇 |
2013年 | 103篇 |
2012年 | 44篇 |
2011年 | 61篇 |
2010年 | 46篇 |
2009年 | 47篇 |
2008年 | 49篇 |
2007年 | 55篇 |
2006年 | 49篇 |
2005年 | 48篇 |
2004年 | 42篇 |
2003年 | 37篇 |
2002年 | 37篇 |
2001年 | 35篇 |
2000年 | 29篇 |
1999年 | 20篇 |
1998年 | 13篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 6篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 1篇 |
排序方式: 共有1010条查询结果,搜索用时 31 毫秒
61.
62.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
63.
Model parameter estimation and residual life prediction for a partially observable failing system 下载免费PDF全文
We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015 相似文献
64.
针对OFDM系统中的信道估计问题,提出了一种基于扩展H∞滤波的OFDM自适应盲信道估计方法。该方法通过对常规H∞算法进行改进,实现了在OFDM系统中能自适应跟踪信道的变化特征,从而使均方误差的性能随着输入信噪比的增加得到很大的提高。仿真结果也验证了该算法优于卡尔曼和H∞估计算法,具有计算复杂度低,运算量小、收敛速度快、算法灵活等特性。 相似文献
65.
66.
学科在武警部队的军事理论创新、信息化进程、武器装备发展和人才培养中具有重要作用。目前,武警院校学科发展现状与建设现代化武警需求还有较大差距。因此,要理清建设思路,打牢发展基础,注重建设实效,提高学科建设水平,为实现“能打胜仗”目标提供有力支撑。 相似文献
67.
68.
郑宪恒 《兵团教育学院学报》2014,24(5):68-75
普通中小学堂图画课程是中国近代化的产物,从1902年"壬寅学制"在政策层面上确立了图画课程的地位开始一直到1911年,普通中小学堂图画课程进行了多次改革。这些改革开启了学校制度下中小学美术教育发展的进程,形成了重"技"的教育指导思想影响下的普通中小学堂图画课程,体现了浓厚的日本学校图画课程色彩,编纂了我国第一批普通中小学图画课程教科书。虽然受时代条件所限,这一时期课程实施效果不尽如人意,但却反映了近代中国美术教育学人在这一时期的艰难探索和追求。 相似文献
69.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献
70.
Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process 下载免费PDF全文
Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014 相似文献